The Use of Modularity Algorithms as part of the Conceptualization of the Perspectival Form in Large Networks

نویسندگان

  • Lorena Regattieri
  • Jean Maicon Medeiros
  • Fabio Malini
چکیده

How can we identify perspectives in large networks through the application of modularity algorithms? In the digital humanities [1][2], there is a fair number of scholarly work exploring computational routines to cluster and analyze enormous amounts of data. Recently, social data became a valuable source to study collective phenomenon, they provide the means to comprehend human collectivity by using graph network analysis. In this paper, we describe our approach on the manner of post-social anthropology [3] and social sciences using technical methods: quantitative analysis and modularity optimization. The computational turn is part of the ongoing process to conceptualize the "perspectival form", as the other would be the semantic analysis of the qualitative data. This technique uses a python script to extract the co-occurrence hashtags network from a Twitter dataset in order to apply in the context of the open-source software Gephi. Our experiments successfully exhibit how social networks can be unfolded when submitting a sample dataset of hashtags to the procedure found in the critical dimension of computational models. Therefore, it discovers the flow of perspectives when the strategy is follow in new workspaces, creating then categories that reveals points of view underneath the controversy. Concluding, this study presents a theoretical and methodological framework based in the post-structuralists, a composition that aims to support studies in different fields of social sciences and humanities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

Optimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms

Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...

متن کامل

Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks

Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...

متن کامل

Two new heuristic algorithms for Covering Tour Problem

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014